#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

void solve() {
  priority_queue<int, vector<int>, greater<int>> mx;
  priority_queue<int> mn;
  int n = 0;
  int x;
  while (cin >> x && x) {
    if (x == -1) {
      n--;
      cout << mn.top() << endl;
      mn.pop();
    } else {
      ++n;
      if (mx.size() && x > mx.top())
        mx.push(x);
      else
        mn.push(x);
    }
    int p = (n + 1) / 2;
    while (mn.size() > p) {
      mx.push(mn.top());
      mn.pop();
    }
    while (mn.size() < p) {
      mn.push(mx.top());
      mx.pop();
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}